Перевод: со всех языков на все языки

со всех языков на все языки

Horner scheme

См. также в других словарях:

  • Horner scheme — In numerical analysis, the Horner scheme or Horner algorithm, named after William George Horner, is an algorithm for the efficient evaluation of polynomials in monomial form. Horner s method describes a manual process by which one may approximate …   Wikipedia

  • Horner — is an English surname that derives from the occupation horner who is a person who cuts the horns off cattle, or deals in horns , or plays a horn.Horner refers to: *People named Horner **Bob Horner (1957 ndash;), American professional baseball… …   Wikipedia

  • Estrin's scheme — In numerical analysis Estrin s scheme (also known as Estrin s method) is an algorithm for numerical evaluation of polynomials. The Horner scheme for evaluation of polynomials is one of the most commonly used algorithms for this purpose and unlike …   Wikipedia

  • William George Horner — (1786 – September 22, 1837) was a British mathematician who was born in Bristol England and died in Bath England. He invented the zoetrope in 1834. ee also*Horner scheme External links * …   Wikipedia

  • New Zealand Emissions Trading Scheme — See also: Climate change in New Zealand The New Zealand Emissions Trading Scheme (NZ ETS) is a national all sectors all greenhouse gases all free allocation uncapped emissions trading scheme. The NZ ETS was first legislated in September 2008 by… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… …   Wikipedia

  • Rational root theorem — In algebra, the rational root theorem (or rational root test to find the zeros) states a constraint on solutions (or roots) to the polynomial equation:a nx^n+a {n 1}x^{n 1}+cdots+a 0 = 0,!with integer coefficients.Let a 0 and a n be nonzero.Then… …   Wikipedia

  • Dynastie Song/Traduction à faire — Modèle:Otheruses Sommaire 1 0 2 Histoire de la dynastie Song 2.1 Les Song du Nord 2.2 Les Song du Sud …   Wikipédia en Français

  • De Casteljau's algorithm — In the mathematical field of numerical analysis, De Casteljau s algorithm is a recursive method to evaluate polynomials in Bernstein form or Bézier curves, named after its inventor Paul de Casteljau. De Casteljau s algorithm can also be used to… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»